Orthogonal Simulated Annealing for Floorplanning
نویسنده
چکیده
Floorplanning is an essential step in physical design of VLSI. The floorplan design problem is how to place a set of circuit modules on a chip such that the resulting area is minimized. The best known solutions are obtained using simulated annealing based on sequence pairs representing the planning of modules. The conventional simulated annealing algorithm conducts a random perturbation operation on a current solution to generate a new solution for each iteration. This paper proposes an orthogonal simulated annealing algorithm OSA using a novel intelligent generation mechanism (IGM) for solving the floorplanning problem. IGM can generate a set of candidate solutions using a number of perturbation operations and then systematically reasons a good solution for each iteration based on orthogonal experimental design. Experimental results using the MCNC and GSRC benchmarks show that OSA can fast obtain the best results ever reported in the literature for the large floorplanning problem.
منابع مشابه
An Improved Algorithm for 3D NoC Floorplanning Based on Particle Swarm Optimization of Nesting Simulated Annealing
In this paper, an improved floorplanning algorithm, named the floorplanning algorithm based on particle swarm optimization algorithm nesting simulated annealing to optimize the floorplans (PSO-SA-NoC), has been proposed with simulations conducted to verify this algorithm. The simulation results are compared with the original Simulated Annealing-NoC. The results show that the CPU’s process time ...
متن کاملOn Objective Functions for Fixed-Outline Floorplanning
-Fixed-outline floorplanning enables multilevel hierarchical design, where aspect ratios and area of floorplans are usually imposed by higher level floorplanning and must be satisfied. Simulated Annealing is widely used in the floorplanning problem. It is well-known that the solution space, solution perturbation, and objective function are very important for Simulated Annealing. In this paper, ...
متن کاملFast floorplanning for effective prediction and construction
Floorplanning is a crucial phase in VLSI Physical Design. The subsequent placement and routing of the cells/modules are coupled very closely with the quality of the floorplan. A widely used technique for floorplanning is Simulated Annealing. It gives very good floorplanning results but has major limitation in terms of running time. For more than tens of modules Simulated Annealing is not practi...
متن کاملA Novel Geometric Algorithm for Fast Wire-Optimized Floorplanning
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wireand areaoptimized floorplans. Through the use of connectivity grouping, simple geometry, and efficient data structures, Traffic achieves higher result quality than Simulated Annealing (SA) in a fraction of the time. This ...
متن کاملSimulated Annealing Based Temperature Aware Floorplanning
Power density of microprocessors is increasing with every new process generation resulting in higher maximum chip temperatures. The high temperature of the chip greatly affects its reliability, raises the leakage power consumed to unprecedented levels, and makes cooling solutions significantly more expensive. The maximum temperature of a block in a chip depends not only on its own power density...
متن کامل